Individual weighted excess and least square values

This work deals with the weighted excesses of players in cooperative games which are obtained by summing up all coalitions to they belong. We first show that resulting payoff vector is corresponding least square value lexicographically minimizing individual over preimputation set, and thus give an alternative characterization values. Second, we these results rise lower upper bounds for core vectors and, using bounds, values can be seen as center a polyhedron defined bounds. provides second new Third, individually rational solution minimizes imputation set.